Sparse Signal Inversion with Impulsive Noise by Dual Spectral Projected Gradient Method
نویسندگان
چکیده
منابع مشابه
Spectral projected gradient method for stochastic optimization
We consider the Spectral Projected Gradient method for solving constrained optimization porblems with the objective function in the form of mathematical expectation. It is assumed that the feasible set is convex, closed and easy to project on. The objective function is approximated by a sequence of Sample Average Approximation functions with different sample sizes. The sample size update is bas...
متن کاملProjected Nesterov's Proximal-Gradient Algorithm for Sparse Signal Recovery
We develop a projected Nesterov’s proximal-gradient (PNPG) approach for sparse signal reconstruction that combines adaptive step size with Nesterov’s momentum acceleration. The objective function that we wish to minimize is the sum of a convex differentiable data-fidelity (negative log-likelihood (NLL)) term and a convex regularization term. We apply sparse signal regularization where the signa...
متن کاملSpectral Projected Gradient Methods
The poor practical behavior of (1)-(2) has been known for many years. If the level sets of f resemble long valleys, the sequence {xk} displays a typical zig-zagging trajectory and the speed of convergence is very slow. In the simplest case, in which f is a strictly convex quadratic, the method converges to the solution with a Q-linear rate of convergence whose factor tends to 1 when the conditi...
متن کاملNomonotone Spectral Gradient Method for Sparse Recovery
In the paper, we present an algorithm framework for the more general problem of minimizing the sum f(x) + ψ(x), where f is smooth and ψ is convex, but possible nonsmooth. At each step, the search direction of the algorithm is obtained by solving an optimization problem involving a quadratic term with diagonal Hessian and Barzilai-Borwein steplength plus ψ(x). The method with the nomonotone line...
متن کاملDual fast projected gradient method for quadratic programming
The application of the fast gradient method to the dual QP leads to the Dual Fast Projected Gradient (DFPG) method. The DFPG converges with O ( k−2 ) rate, where k > 0 is the number of steps. At each step, it requires O(nm) operations. Therefore for a given ε > 0 an ε-approximation to the optimal dual function value
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2017
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2017/2736306